The distribution of 1-widths of (0, 1)-matrices
نویسندگان
چکیده
منابع مشابه
The Gelfand widths of ℓp-balls for 0<p≤1
We provide sharp lower and upper bounds for the Gelfand widths of lp-balls in the N -dimensional lNq -space for 0 < p ≤ 1 and p < q ≤ 2. Such estimates are highly relevant to the novel theory of compressive sensing, and our proofs rely on methods from this area.
متن کامل(0, ±1) Ideal Matrices
A (0; 1) matrix A is said to be ideal if all the vertices of the polytope Q(A) = fx : Ax 1; 0 x 1g are integral. The issue of nding a satisfactory characterization of those matrices which are minimally non-ideal is a well known open problem. An outstanding result toward the solution of this problem, due to Alfred Lehman, is the description of crucial properties of minimally non-ideal matrices. ...
متن کاملPerfect 0 , + 1 Matrices *
Perfect graphs and perfect 0,l matrices are well studied in the literature. Here we introduce perfect 0, f 1 matrices. Our main result is a characterization of these matrices in terms of a family of perfect 0,l matrices. 0 Elsevim Science Inc., 1997 * This work was supported in part by NSF grants DMI-9424348 and DMS-9509581, and by ONR grant NOOO14-89-J-1063. LINEAR ALGEBRA AND ITS APPLZCATIONS...
متن کاملOn the Energy of (0, 1)-matrices
The energy of a matrix is the sum of its singular values. We study the energy of (0, 1)matrices and present two methods for constructing balanced incomplete block designs whose incidence matrices have the maximum possible energy amongst the family of all (0, 1)-matrices of given order and total number of ones. We also find a new upper bound for the energy of (p, q)-bipartite graphs. AMS Subject...
متن کاملOn perfect 0, +/- 1 matrices,
Perfect 0,±1 matrices were introduced recently in [5] as a generalization of the well-studied class of perfect 0, 1 matrices. In this paper we provide a characterization of perfect 0,±1 matrices in terms of an associated perfect graph which one can build in O(nm) time, where m × n is the size of the matrix. We also obtain an algorithm of the same time complexity, for testing the irreducibility ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1977
ISSN: 0012-365X
DOI: 10.1016/0012-365x(77)90051-6